An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
نویسندگان
چکیده
We define a new Newton-type method for the solution of constrained systems of equations and analyze in detail its properties. Under suitable conditions, that do not include differentiability or local uniqueness of solutions, the method converges locally quadratically to a solution of the system of equations, thus filling an important gap in the existing theory. The new algorithm improves on known methods and, when particularized to KKT systems deriving from optimality conditions for constrained optimization or variational inequalities, it has theoretical advantages even over methods specifically designed to solve such systems.
منابع مشابه
A family of Newton methods for nonsmooth constrained systems with nonisolated solutions
We propose a new family of Newton-type methods for the solution of constrained systems of equations. Under suitable conditions, that do not include differentiability or local uniqueness of solutions, local, quadratic convergence to a solution of the system can be established. We show that as particular instances of the method we obtain inexact versions of both a recently introduced LP-based New...
متن کاملC Xxxxx Society for Industrial and Applied Mathematics a Globally Convergent Lp–newton Method *
We develop a globally convergent algorithm based on the LP-Newton method which has been recently proposed for solving constrained equations, possibly nonsmooth and possibly with nonisolated solutions. The new algorithm makes use of linesearch for the natural merit function, and preserves the strong local convergence properties of the original LP-Newton scheme. We also present computational expe...
متن کاملA Globally Convergent LP-Newton Method
We develop a globally convergent algorithm based on the LP-Newton method, which has been recently proposed for solving constrained equations, possibly nonsmooth and possibly with nonisolated solutions. The new algorithm makes use of linesearch for the natural merit function and preserves the strong local convergence properties of the original LP-Newton scheme. We also present computational expe...
متن کاملA globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points
The LP-Newton method for constrained equations, introduced some years ago, has powerful properties of local superlinear convergence, covering both possibly nonisolated solutions and possibly nonsmooth equation mappings. A related globally convergent algorithm, based on the LP-Newton subproblems and linesearch for the equation’s infinity-norm residual, has recently been developed. In the case of...
متن کاملGeneralized Newton and Ncp - Methods : Convergence , Regularity , Actions
Solutions of several problems can be modelled as solutions of nonsmooth equations. Then, Newton-type methods for solving such equations induce particular iteration steps (actions) and regularity requirements in the original problems. We study these actions and requirements for nonlinear complementarity problems (NCP’s) and Karush–Kuhn–Tucker systems (KKT) of optimization models. We demonstrate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 146 شماره
صفحات -
تاریخ انتشار 2014